Balancing games

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Educationally Adaptive: Balancing Serious Games

A key factor for the success and efficacy of an educational medium is the extent to which it is capable of addressing the preferences, abilities, strengths, weaknesses, and goals of individual learners. Research in the field of learning and instruction has demonstrated in the past that one on one tutoring is the most effective and powerful way of teaching. Ever since, the research community att...

متن کامل

Competition yields efficiency in load balancing games

We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this ‘load balancing game’, each provider has the freedom to set a price, or toll, for access to the link and seeks to maximize its own profit. Given prices, a Wardrop equilibrium among users is assumed, under which users all choose paths ofminimal and identical e...

متن کامل

Mediated Equilibria in Load-Balancing Games

Mediators are third parties to whom the players in a game can delegate the task of choosing a strategy; a mediator forms a mediated equilibrium if delegating is a best response for all players. Mediated equilibria have more power to achieve outcomes with high social welfare than Nash or correlated equilibria, but less power than a fully centralized authority. Here we begin the study of the powe...

متن کامل

On a Class of Balancing Games

A balancing game is a perfect information two-person game. Given a set V C R&, in the zth round Player I picks a vector UC E V, and then Player II picks C~ = j-1 or -1. Player II tries to minimize sup {\I Z$+ E& Ii : fi = 0, 1, 2,...]. In this paper we generalize this game and give necessary and sufhcient conditions for the existence of a wimCng strategy for Player I and Player II in the genera...

متن کامل

Balancing Load via Small Coalitions in Selfish Ring Routing Games

This paper concerns the asymmetric atomic selfish routing game for load balancing in ring networks. In the selfish routing, each player selects a path in the ring network to route one unit traffic between its source and destination nodes, aiming at a minimum maximum link load along its own path. The selfish path selections by individuals ignore the system objective of minimizing the maximum loa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1977

ISSN: 0095-8956

DOI: 10.1016/0095-8956(77)90057-0